Rigged Configurations and Catalan Objects: Completing a Commutative Diagram with Dyck Paths and Rooted Planar Trees
نویسنده
چکیده
We construct an explicit bijection between rigged configurations and rooted planar trees, which we prove is the composition of the the bijection defined by Kerov, Kirillov, and Reshitikhin between rigged configurations and Dyck paths and the bijection between Dyck paths and rooted planar trees defined by the planar code.
منابع مشابه
The butterfly decomposition of plane trees
We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a oneto-one correspondence between doubly rooted plane trees and free Dyck paths, which implies a simple derivation of a relation between the Catalan numbers and the central binomial...
متن کاملEnumeration of connected Catalan objects by type
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product formula which enumerates these objects according to type. We define a notion of ‘connectivity’ for these objects and prove an analogous product formula which counts connected objects by type. Our proof of this product ...
متن کاملA Strahler bijection between Dyck paths and planar trees
The Strahler number of binary trees has been introduced by hydrogeologists and rediscovered in computer science in relation with some optimization problems. Explicit expressions have been given for the Strahler distribution, i.e. binary trees enumerated by number of vertices and Strahler number. Two other Strahler distributions have been discovered with the logarithmic height of Dyck paths and ...
متن کاملConstructing combinatorial operads from monoids
We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operad obtained from the additive monoid. These involve various familiar combinatorial objects: parking functions, packed words, planar rooted trees, generalized Dyck paths, Schröder trees, Motzkin paths, integer compositions, directed an...
متن کاملCuntz-krieger Algebras and a Generalization of Catalan Numbers
We first observe that the relations of the canonical generating isometries of the Cuntz algebra ON are naturally related to the N-colored Catalan numbers. For a directed graph G, we generalize the Catalan numbers by using the canonical generating partial isometries of the Cuntz-Krieger algebra O AG for the transition matrix A of G. The generalized Catalan numbers cGn , n = 0, 1, 2, . . . enumer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015